Optical Solver of Combinatorial Problems: Nano-Technological Approach

نویسندگان

  • Eyal Cohen
  • Shlomi Dolev
  • Sergey Frenkel
  • Boris Kryzhanovsky
  • Alexandr Palagushkin
  • Michael Rosenblit
  • Victor N. Zakharov
چکیده

We present an optical computing system to solve NP-hard problems. As nano-optical computing is a promising venue for the next generation of computers performing parallel computations, we investigate the application of submicron, or even subwavelength, computing device designs. The system utilizes a setup of exponential sized masks with exponential space complexity produced in polynomial time preprocessing. The masks are later used to solve the problem in polynomial time. The size of the masks is reduced to nanoscaled density. Simulations were done to choose a proper design, and actual implementations show the feasibility of such a system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

متن کامل

Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem: Application to Materials Discovery

Exploiting parallelism is a key strategy for speeding up computation. However, on hard combinatorial problems, such a strategy has been surprisingly challenging due to the intricate variable interactions. We introduce a novel way in which parallelism can be used to exploit hidden structure of hard combinatorial problems. Our approach complements divide-and-conquer and portfolio approaches. We e...

متن کامل

GHOST: A Combinatorial Optimization Solver for RTS-related Problems

This paper presents GHOST, a combinatorial optimization solver an RTS AI developer can use as a blackbox to solve any problems encoded by a constraint satisfaction/optimization problem. We show a way to model three very different RTS problems by a constraint satisfaction/optimization problem, each problem belonging to a specific level of abstraction, and test our solver on them, using StarCraft...

متن کامل

Extending an Algebraic Modeling Language to Support Constraint Programming

Although algebraic modeling languages are widely used in linear and nonlinear programming applications, their use for combinatorial or discrete optimization has largely been limited to developing integer linear programming models for solution by general-purpose branch-and-bound procedures. Yet much of a modeling language’s underlying structure for expressing integer programs is equally useful f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of the Optical Society of America. A, Optics, image science, and vision

دوره 30 9  شماره 

صفحات  -

تاریخ انتشار 2013